Ben Cole
ABSTRACT
We present a novel 2D cellular automaton with rules that are a non-uniform generalization of a Moore-neighbourhood, outer-totalistic, two-state ("life-like") cellular automaton. The system is purely deterministic and exhibits interesting multi-scale emergent behaviour, including the spontaneous formation of mobile particles and other self-organizing structures. In particular, smaller-scale structures can be shown to combine with other structures to form inhomogeneous higher-order constructions, and to do so at multiple orders of magnitude. The system has features in common with reaction-diffusion models. We propose that this system has properties that make it useful as a model of an artificial chemistry with the potential for supporting open-ended evolutionary growth. We call it Nu-life.
- Adamatzky, A., Martínez, G., and Mora, J., 2006. Phenomenology of Reaction-Diffusion Binary-State Cellular Automata in Int. J. Bifurcation Chaos 16, 2985 (2006). DOI: 10.1142/S021812740601659Google Scholar
- Bedau, M., McCaskill, J., Packard, N., Rasmussen, S., Adami, C., Green, D., Ikegami, T., Kaneko, K., and Ray, T., 2000. Open Problems in Artificial Life in Artificial Life 2000 6:4, 363--376. DOI 10.1162/106454600300103683 Google ScholarDigital Library
- Dittrich, P., Ziegler J., Banzhaf, W., 2001, Artificial Chemistries - a Review in Artificial Life. Summer 2001, Vol. 7, No. 3, Pages 225--275 doi:10.1162/106454601753238636. Google ScholarDigital Library
- Eppstein, D., 2010, Growth and Decay in Life-Like Cellular Automata in Game of Life Cellular Automata, pp 71--97, Springer London, DOI:10.1007/978-1-84996-217-9_6Google Scholar
- Garner, M., 1971, On Cellular automata, self-reproduction, and the game "life" in Scientfic American (February, 1971).Google Scholar
- Hutton, T., 2007 Evolvable Self Reproducing Cells in an Artificial Chemistry in Artificial Life Winter 2007, Vol. 13, No. 1, Pages 11--30 DOI 10.1162/artl.2007.13.1.11. Google ScholarDigital Library
- Medernach, D., Kowaliw, T., Ryan, C., and Doursat R. 2013. Long-term evolutionary dynamics in heterogeneous cellular automata. In Proceedings of the 15th annual conference on Genetic and evolutionary computation (GECCO '13), Christian Blum (Ed.). ACM, New York, NY, USA, 231--238. DOI=10.1145/2463372.2463395. Google ScholarDigital Library
- Sipper, M., 1997 and 2004. Evolution of Parallel Cellular Machines: The Cellular Programming Approach: Springer-Verlag. Google ScholarDigital Library
- Taylor, T. 1999. Creativity in evolution: Individuals, interactions and environment. In P. Bentley & D. Corne (Eds.), Proceedings of the AISB'99 Symposium on Creative Evolutionary Systems, The Society for the Study of Artificial Intelligence and Simulation of Behaviour. Edinburgh: Morgan Kaufman. Google ScholarDigital Library
- Turing, A., 1952. "The Chemical Basis of Morphogenesis," Philosophical Transactions of the Royal Society of London, Series B, No. 641, Vol. 237, pp. 37--72.Google Scholar
- Wolfram, S. 2002. A New Kind of Science, Wolfram Media, Inc., Champaign, Illinois. Google ScholarDigital Library
Index Terms
- Nu-life: spontaneous dynamic hierarchical organization in a non-uniform "life-like" cellular automata
Recommendations
Input-driven languages are linear conjunctive
Linear conjunctive grammars define the same family of languages as one-way real-time cellular automata (A. Okhotin, "On the equivalence of linear conjunctive grammars to trellis automata", RAIRO ITA, 2004), and this family is known to be incomparable ...
Iterated uniform finite-state transducers on unary languages
AbstractAn iterated uniform finite-state transducer executes the same length-preserving transduction in iterative sweeps. The first sweep occurs on the input string, while any subsequent sweep works on the output of the previous one. All sweeps always ...
Highlights- We study Iterated Uniform Finite-State Transducers (IUFSTs) working on unary languages.
- We compare IUFSTs size with that of unary classical finite-state automata.
- We relate IUFSTs and one-way cellular automata recognition power.
Iterated Uniform Finite-State Transducers on Unary Languages
SOFSEM 2021: Theory and Practice of Computer ScienceAbstractWe consider the model of an iterated uniform finite-state transducer, which executes the same length-preserving transduction in iterative sweeps. The first sweep takes place on the input string, while any subsequent sweep works on the output of ...
Comments